Fault-Containment in Weakly-Stabilizing Systems

Research on fine tuning stabilization properties has received attention for more than a decade. This paper presents probabilistic algorithms for fault containment. We demonstrate two exercises in fault containment in a weakly stabilizing system, which expedite recovery from single failures, and confine the effect of any single fault to the constant-distance neighborhood of the faulty process. The most significant aspect of the algorithms is that the fault gap, defined as the smallest interval after which the system is ready tohandle thenext single faultwith the sameefficiency, is independent of thenetwork size. We argue that a small fault gap increases the availability of the fault-free system. © 2011 Elsevier B.V. All rights reserved.